Quasi-cyclic unit memory convolutional codes
نویسندگان
چکیده
منابع مشابه
Quasi-cyclic unit memory convolutional codes
Unit memory convolutional codes with generator matrices, which are composed of circulant suhmatrices, are introduced. This structure facilitates the analysis as well as an efficient search for good codes. Equivalences among such codes and consider some of the basic structural properties are discussed. In particular, catastrophic encoders and minimal encoders are characterized and dual codes tre...
متن کاملConstruction of Unit-Memory MDS Convolutional Codes
Maximum-distance separable (MDS) convolutional codes form an optimal family of convolutional codes, the study of which is of great importance. There are very few general algebraic constructions of MDS convolutional codes. In this paper, we construct a large family of unit-memory MDS convolutional codes over Fq with flexible parameters. Compared with previous works, the field size q required to ...
متن کاملUnit Memory Convolutional Codes with Maximum Distance
Unit memory codes and in particular, partial unit memory codes are reviewed. Conditions for the optimality of partial unit memory codes with degree k− 1 are given, where optimal codes are the codes having the maximum free distance among all codes of the same parameters k,n and degree μ. A binary construction of unit memory codes with μ = k − 1 is discussed for the cases that satisfy the optimal...
متن کاملOn cyclic convolutional codes
We investigate the notion of cyclicity for convolutional codes as it has been introduced in the papers [15, 18]. Codes of this type are described as submodules of F[z]n with some additional generalized cyclic structure but also as specific left ideals in a skew polynomial ring. Extending a result of [15], we show in a purely algebraic setting that these ideals are always principal. This leads t...
متن کاملLow Density Parity Check Convolutional Codes Derived from Quasi-Cyclic Block Codes
Abstract Using algebraic techniques, one of the co-authors has designed a [155,64,20] low density parity check code based on permutation matrices. This code is quasi-cyclic by construction and hence admits a convolutional representation. A set of low density parity check convolutional codes is derived from this quasi-cyclic code and its generalizations. We investigate the performance of these c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Transactions on Information Theory
سال: 1990
ISSN: 0018-9448
DOI: 10.1109/18.54876